Polynomial Algorithms for Item Matching
نویسندگان
چکیده
منابع مشابه
Polynomial Algorithms for Item Matching
can be found at: Applied Psychological Measurement Additional services and information for http://apm.sagepub.com/cgi/alerts Email Alerts: http://apm.sagepub.com/subscriptions Subscriptions: http://www.sagepub.com/journalsReprints.nav Reprints: http://www.sagepub.com/journalsPermissions.nav Permissions: http://apm.sagepub.com/cgi/content/refs/16/4/365 SAGE Journals Online and HighWire Press p...
متن کاملTwo polynomial algorithms for special maximum matching constructing in trees
For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding polynomial algorithms.
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملRepresenting Pattern Matching Algorithms by Polynomial-Size Automata
Pattern matching algorithms to find exact occurrences of a pattern S ∈ Σ in a text T ∈ Σ have been analyzed extensively with respect to asymptotic best, worst, and average case runtime. For more detailed analyses, the number of text character accesses X n performed by an algorithm A when searching a random text of length n for a fixed pattern S has been considered. Constructing a state space an...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Psychological Measurement
سال: 1992
ISSN: 0146-6216,1552-3497
DOI: 10.1177/014662169201600408